منابع مشابه
Bounding basis reduction properties
The paper describes improved analysis techniques for basis reduction that allow one to prove strong complexity bounds and reduced basis guarantees for traditional reduction algorithms and some of their variants. This is achieved by a careful exploitation of the linear equations and inequalities relating various bit sizes before and after one or more reduction steps.
متن کاملFundamental Properties of Harmonic Bounding
Evaluation in OT adjudicates competitions between linguistic structures, but it calculates only with the array of violations that the structures incur under each constraint: their violation profiles. Structures with the same profile are indistinguishable, and differences in structure only register to the extent that they correlate with differences in violation. General properties that govern re...
متن کاملHeuristic Rules , Bounding and State Space Reduction
An alternative approach towards dynamic programming (DP) is presented: Recursions. A basic deterministic model and solution function are defined and the model is generalized to include stochastic processes, with the traditional stochastic DP model as a special case. Heuristic rules are included in the models simply as restrictions on decision spaces and a small slaughter pig marketing planning ...
متن کاملA characterization of the 0-basis homogeneous bounding degrees
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B ∼= A such that the elementary diagram of B is (d-)computable. Goncharov, Millar, and Peretyat’kin independently showed there exists a homogeneous model A with a 0-basis but no decidable copy. We extend this result here. Let d ≤ 0′ be any low2 ...
متن کاملBasis Reduction Methods
where P is a polyhedron described by inequalities. The work of Lenstra in 1979 [1] answered one of the most challenging questions in the theory of integer programming by presenting an algorithm to solve (IP), whose running time is polynomial, when n, the dimension is fixed. This paper pioneered the use of lattice basis reduction in integer programming, and initiated an interest in polynomial re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2016
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-016-0273-9